#include<bits/stdc++.h>
using namespace std;
int n;
const int maxn=100005;
int a[maxn],visited[maxn],e[maxn];
inline bool judge(int xx,int yy){
    bool flag=true;
    if (a[xx]>=a[yy]){
        flag=false;
    }
    return flag;
}
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    memset(visited,0,sizeof(visited));
    memset(e,0,sizeof(e));
    sort(a+1,a+1+n);
    for(int i=1;i<n;i++){
        for(int j=i+1;j<=n;j++){
            if (e[i] || visited[j]) continue;
            if (judge(i,j)){
                e[i]=1;
                visited[j]=1;
                break;
            }
        }
    }
    int ans=0;
    for(int i=1;i<=n;i++){
        if (!e[i]){
            ans++;
        }
    }
    cout<<ans;
    fclose(stdin);
    fclose(stdout);
    return 0;
}
